Cryptographic Criteria on Vector Boolean Functions
نویسندگان
چکیده
Most modern block and stream ciphers can be expressed as certain arrangement of Vector Boolean Functions. Thus, in the context of block and stream ciphers’ design (mainly in S-boxes and combining functions respectively), it is essential to define criteria which measure the cryptographic strength of Boolean Functions and Vector Boolean Functions. Ideally, some of the following requirements must be fulfilled by this criteria:
منابع مشابه
Generalization of Higher Order SAC to Vector Output Boolean Functions
S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC(k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC(k) to vector output Boolean functions as the rst step t...
متن کاملOn Cryptographic Properties of Random Boolean Functions
Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are some properties (balancedness, nonlinearity, high algebraic degree, correlation immunity, propagation criteria) which a cryptographically strong Boolean function ought to have. We study the above me...
متن کاملThe complexity of Boolean functions from cryptographic viewpoint
Cryptographic Boolean functions must be complex to satisfy Shannon’s principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit complexity. The two main criteria evaluating the cryptographic complexity of Boolean functions on F n 2 are the nonlinearity (and more generally the r-th order nonlinearity, for every positive r < n) and the algebraic degree. Tw...
متن کاملDesign of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
A Boolean function f satis es PC(l) of order k if f(x) f(x ) is balanced for any such that 1 W ( ) l even if any k input bits are kept constant, where W ( ) denotes the Hamming weight of . This paper shows the rst design method of such functions which provides deg(f) 3. More than that, we show how to design \balanced" such functions. High nonlinearity and large degree are also obtained. Further...
متن کاملCryptographic Boolean functions: One output, many design criteria
Boolean functions represent an important primitive in the design of various cryptographic algorithms. There exist several well-known schemes where a Boolean functions is used to add nonlinearity to the cipher. Thus, methods to generate Boolean functions that possess good cryptographic properties is an important research goal. Among other techniques, evolutionary computation has proved to be a w...
متن کامل